Bi-criteria Three Stage Fuzzy Flowshop Scheduling with Transportation Time and Job Block Criteria
نویسندگان
چکیده مقاله:
Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines flowshop scheduling to minimize the makespan and the rental cost of the machines taken on rent under a specified rental policy in which processing time, transportation time are in fuzzy environment and are represented by triangular fuzzy membership function. Further, the concept of job block to represent the relative importance of some jobs over other is also introduced. A heuristic algorithm to find optimal or near optimal sequence optimizing the bi-criteria is discussed. A numerical illustration is given to demonstrate the computational efficiency of proposed algorithm.
منابع مشابه
Bi-criteria Scheduling on Parallel Machines Under Fuzzy Processing Time
Job scheduling is concerned with the optimal allocation of scare resources with objective of optimising one or several criteria. Job scheduling has been a fruitful area of research for many decades in which scheduling resolve both allocation of machines and order of processing. If the jobs are scheduled properly, not only the time is saved but also efficiency of system is increased. The paralle...
متن کاملTwo Machines Flow Shop Scheduling with Single Transport Facility and Job-Block Criteria under Fuzzy Environment
This paper pertains to a two machine flowshop scheduling involving independent setup time, transportation time and job block criteria in fuzzy environment. Further, a single transporting agent which carries the jobs from one machine to another is also considered. The objective of the paper is to minimize the makespan, idle time of the machines whenever the processing time, setup time each are u...
متن کاملOn Two Stage Open-Shop Scheduling With Job Block Criteria and Weights of Jobs Involving Processing Time, Associated With Probabilities
The specific goal of this paper is to present an efficient heuristic for n-jobs, two machine open shop scheduling involving job block criteria and weights of jobs due to their relative importance, under the condition when probabilities are associate with processing time to obtain an optimal or near optimal sequence which minimize the makespan. The proposed heuristic developed in this paper is s...
متن کاملOn Two Stage Open Shop Scheduling in Which Processing Time, Set Up Time Associated with Probabilities Including Job Block Criteria
INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY On Two Stage Open Shop Scheduling in Which Processing Time, Set Up Time Associated with Probabilities Including Job Block Criteria Deepak Gupta, Manjeet Kaur *1,2 Department of Mathematics, Maharishi Markandeshwar University, Mullana, Ambala, India [email protected] Abstract The present paper is an attempt through heu...
متن کاملBi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects
In traditional scheduling problems, the processing time for the given job is assumed to be a constant regardless of whether the job is scheduled earlier or later. However, the phenomenon named ‘‘learning effect’’ has extensively been studied recently, in which job processing times decline as workers gain more experience. This paper discusses a bi-criteria scheduling problem in anm-machine permu...
متن کاملA bi-criteria two-machine flowshop scheduling problem with a learning effect
This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to search for the exact solution for small j...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 3 شماره None
صفحات 0- 0
تاریخ انتشار 2013-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023